Basis characterization in a two-commodity network
نویسندگان
چکیده
In this paper we describe the structure of a basis for two-commodity network ow problems combinatorially. In other words we give an interpretation of the structure of a basis. We also give an algorithm to nd all the bases. We think of the two-commodity network problem as two networks, each having capacities on the arcs, with side constraints which takes care of bounds on total arc ow.
منابع مشابه
Comparing Two Methods of Neural Networks to Evaluate Dead Oil Viscosity
Reservoir characterization and asset management require comprehensive information about formation fluids. In fact, it is not possible to find accurate solutions to many petroleum engineering problems without having accurate pressure-volume-temperature (PVT) data. Traditionally, fluid information has been obtained by capturing samples and then by measuring the PVT properties in a laboratory. In ...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملOptimizing Bi-Objective Multi-Commodity Tri-Echelon Supply Chain Network
The competitive market and declined economy have increased the relevant importance of making supply chain network efficient. This has created many motivations to reduce the cost of services, and simultaneously, to increase the quality of them. The network as a tri-echelon one consists of Suppliers, Warehouses or Distribution Centers (DCs), and Retailer nodes. To bring the problem closer to real...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملMulti-perspective Decision Support System for Hierarchical Bus Transportation Network Design: Tehran Case Study
In this paper, a multi-perspective decision support system (MP-DSS) to design hierarchical public transportation network is developed. Since this problem depends on different perspectives, MP-DSS consists of two sub-systems with macro and micro sub-systems based on travel information, land use and expert knowledge. In the micro sub-system, two sub-modules are developed considering o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998